A circ is an undirected graph having only vertices of even nonzero degree . 一廣義圈是一無向圖,其頂點(diǎn)次數(shù)都是非零偶數(shù)。
The super restricted edge connectivity of kautz undirected graphs 圖的超級(jí)限制邊連通性
Graphs studied in this dissertation are finit , simple , undirected graphs 本文所涉及的圖均為無向、簡單的有限圖。
Abstract : broadcast networks can be expressed by a simple connected undirected graph 文摘:將廣播網(wǎng)絡(luò)用簡單連通的無向圖表示。
First , define the palm - line undirected graph according to the palm - lines ’ character 首先,根據(jù)掌紋線的特點(diǎn),對(duì)掌紋線無向圖進(jìn)行了嚴(yán)格定義。
The theory of graphs can be roughly partitioned into two branches : the areas of undirected graphs and directed graphs ( digraphs ) 圖論大致可分為兩個(gè)方向:無向圖與有向圖。
Then , advance an algorithm for constructing the palm - line undirected graph according to the connection of the points on the palm - line 其次,根據(jù)掌紋線上各點(diǎn)的連結(jié)情況,提出一種掌紋線無向圖的構(gòu)建算法。
A simple undirected graph is said to be semisymmetric if it is regular and edge - transitive but not vertex - transitive . this thesis consists of two parts 如果一個(gè)簡單的無向圖是正則的,邊傳遞但不是點(diǎn)傳遞的,那么稱它是半對(duì)稱的。
All graphs are finite simple undirected graph with no isolated vertices in this paper . it is completed the classification of graphs on which a semidihedral group acts edge - transitively 摘要運(yùn)用圖的自同構(gòu)理論,獲得了關(guān)于半二面體群邊傳遞的圖的完全分類。
Observing lots of palm images and their palm - line undirected graph and analyzing the experts ’ knowledge , we extract the recognition features of cross structure and mi structure 觀察大量的手掌圖像及其相應(yīng)的掌紋線無向圖,并結(jié)合手掌診病專家知識(shí),分別提取出十字紋和米字紋的識(shí)別特征。